Definition

Consider axioms of propositional logic to hold. In addition,
#incomplete

Kripke's S5 system (formulated via knowledge operators)

Knowledge operator KiK_i of player ii satisfies following five properties, collectively known as Kripke's S5 System:

  1. KiY=YK_i Y = Y: player knows YY is set of all states of the world
  2. KiAKiB=Ki(AB)K_i A \cap K_i B = K_i (A \cap B): if player knows event AA and knows event BB ten he knows event ABA \cap B.
  3. KiAAK_i A \subseteq A: if player knows event AA then event AA obtains
  4. KiKiA=KiAK_i K_i A = K_i A: if player knows event AA then he knows he knows event AA and vice versa
  5. (KiA)c=Ki((KiA)C)(K_i A)^c = K_i((K_i A)^C): if the player does not know event AA, then he knows he does not know event AA, and vice versa

Notes

This is a type of modal logic. It may be alternatively formulated using the language of modal operators,
#incomplete

𝐊\mathbf{K} logic


References

  1. https://plato.stanford.edu/entries/logic-modal/#ModLog
  2. M. Maschler, E. Solan, and Shmuel Zamir, Game Theory, Cambridge University Press, 2013, p. 327.
  3. https://ncatlab.org/nlab/show/S5+modal+logic
  4. https://math.stackexchange.com/questions/815455/why-is-square-square-square-and-diamond-diamond-diamond-in-the-s5-modal
  5. https://www3.cs.stonybrook.edu/~cse371/13(modal).pdf
  6. https://en.wikipedia.org/wiki/S5_(modal_logic)
  7. https://mally.stanford.edu/s5.html
  8. https://en.wikipedia.org/wiki/Alvin_Plantinga#Modal_ontological_argument